Toggle navigation
Home
About
About Journal
Historical Evolution
Indexed In
Awards
Reference Index
Editorial Board
Journal Online
Archive
Project Articles
Most Download Articles
Most Read Articles
Instruction
Contribution Column
Author Guidelines
Template
FAQ
Copyright Agreement
Expenses
Academic Integrity
Contact
Contact Us
Location Map
Subscription
Advertisement
中文
Journals
Publication Years
Keywords
Search within results
(((HAO Kun[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Priority calculation method of software crowdsourcing task release
ZHAO Kunsong, YU Dunhui, ZHANG Wanshan
Journal of Computer Applications 2018, 38 (
7
): 2032-2036. DOI:
10.11772/j.issn.1001-9081.2018010001
Abstract
(
551
)
PDF
(757KB)(
364
)
Knowledge map
Save
Aiming at the problem that the existing software crowdsourcing platforms do not consider the order of task release, a method of calculating Task Release Priority (TRP) of software crowdsourcing based on task publisher weight and task weight was proposed. Firstly, a time weight function based on semi-sinusoidal curve was used to measure the activity of the task publisher and the cumulative turnover of the task, so as to calculate the weight of the task publisher. Secondly, the task complexity was calculated according to the system architecture diagram and data flow diagram to measure module complexity, design complexity and data complexity, and the task benefit factor and task emergency factor were calculated based on task quotation and task duration. In this way, the task weight was calculated. Finally, the task publishing priority would be given according to task publisher weight and task weight. The experimental results show that the proposed algorithm not only is effective and reasonable, but also has a maximum success rate of 98%.
Reference
|
Related Articles
|
Metrics
Select
Optimization of density-based
K
-means algorithm in trajectory data clustering
HAO Meiwei, DAI Hualin, HAO Kun
Journal of Computer Applications 2017, 37 (
10
): 2946-2951. DOI:
10.11772/j.issn.1001-9081.2017.10.2946
Abstract
(
452
)
PDF
(1029KB)(
468
)
Knowledge map
Save
Since the traditional
K
-means algorithm can hardly predefine the number of clusters, and performs sensitively to the initial clustering centers and outliers, which may result in unstable and inaccurate results, an improved density-based
K
-means algorithm was proposed. Firstly, high-density trajectory data points were selected as the initial clustering centers to perform
K
-means clustering by considering the density of the trajectory data distribution and increasing the weight of the density of important points. Secondly, the clustering results were evaluated by the Between-Within Proportion (BWP) index of cluster validity function. Finally, the optimal number of clusters and clustering were determined according to the clustering results evaluation. Theoretical researches and experimental results show that the improved algorithm can be better at extracting the trajectory key points and keeping the key path information. The accuracy of clustering results was 28 percentage points higher than that of the traditional
K
-means algorithm and 17 percentage points higher than that of the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. The proposed algorithm has a better stability and a higher accuracy in trajectory data clustering.
Reference
|
Related Articles
|
Metrics
Select
Quantum-inspired clonal algorithm based method for optimizing neural networks
QI Hao WANG Fubao DENG Hong ZHAO Kun WANG Liang MA Yin DUAN Weijun
Journal of Computer Applications 2014, 34 (
2
): 496-500.
Abstract
(
464
)
PDF
(719KB)(
420
)
Knowledge map
Save
In order to reduce the redundant connections and unnecessary computing cost, quantum-inspired clonal algorithm was applied to optimize neural networks. By generating neural network weights which have certain sparse ratio, the algorithm not only effectively removed redundant neural network connections and hidden layer nodes, but also improved the learning efficiency of neural network, the approximation of function accuracy and generalization ability. This method had been applied to wild relics security system of Emperor Qinshihuang's mausoleum site museum, and the results show that the method can raise the probability of target classification and reduce the false alarm rate.
Related Articles
|
Metrics